Importance sampling for maxima on trees
نویسندگان
چکیده
We study the all-time supremum of perturbed branching random walk, known to be endogenous solution high-order Lindley equation: W = D max Y , 1 ≤ i N ( + X ) where { } are independent copies vector taking values in R × ∞ . Under Kesten assumptions, this satisfies P > t ∼ H e − α → 0 solves Cramér–Lundberg equation E ∑ This paper establishes tail asymptotics by using forward iterations map defining fixed-point combined with a change measure along randomly chosen path. new approach provides an explicit representation constant and gives rise unbiased strongly efficient estimators for rare event probabilities
منابع مشابه
Dynamic importance sampling in Bayesian networks based on probability trees
In this paper we introduce a new dynamic importance sampling propagation algorithm for Bayesian networks. Importance sampling is based on using an auxiliary sampling distribution from which a set of configurations of the variables in the network is drawn, and the performance of the algorithm depends on the variance of the weights associated with the simulated configurations. The basic idea of d...
متن کاملTwo-phase importance sampling for inference about transmission trees
There has been growing interest in the statistics community to develop methods for inferring transmission pathways of infectious pathogens from molecular sequence data. For many datasets, the computational challenge lies in the huge dimension of the missing data. Here, we introduce an importance sampling scheme in which the transmission trees and phylogenies of pathogens are both sampled from r...
متن کاملOn improved estimation for importance sampling
The standard estimator used in conjunction with importance sampling in Monte Carlo integration is unbiased but inefficient. An alternative estimator is discussed, based on the idea of a difference estimator, which is asymptotically optimal. The improved estimator uses the importance weight as a control variate, as previously studied by Hesterberg (Ph.D. Dissertation, Stanford University (1988);...
متن کاملNotes on optimal approximations for importance sampling
In this manuscript, we derive optimal conditions for building function approximations that minimize variance when used as importance sampling estimators for Monte Carlo integration problems. Particularly, we study the problem of finding the optimal projection g of an integrand f onto certain classes of piecewise constant functions, in order to minimize the variance of the unbiased importance sa...
متن کاملImportance Sampling for Bayesian
Bayesian networks (BNs) offer a compact, intuitive, and efficient graphical representation of uncertain relationships among the variables in a domain and have proven their value in many disciplines over the last two decades. However, two challenges become increasingly critical in practical applications of Bayesian networks. First, real models are reaching the size of hundreds or even thousands ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Stochastic Processes and their Applications
سال: 2022
ISSN: ['1879-209X', '0304-4149']
DOI: https://doi.org/10.1016/j.spa.2022.02.005